Development of ACO Algorithm for Service Restoration in Distribution system

نویسندگان

  • Rajneesh Karn
  • Yogendra Kumar
  • Gayatri Agnihotri
چکیده

Service restoration in power distribution system involves operating the line switches to restore as many loads as possible for the areas isolated by a fault. In case of partial restoration, the supply must be restored to highest priority customers (e.g. hospitals) and this fact should be reflected in the final solution of service restoration problem. Thus service restoration problem is formulated as multi objective, multi constraint combinatorial optimization problem. This paper proposes an Ant Colony Optimization (ACO) algorithm for a minimization problem of energy not supplied during restoration process. The proposed ACO algorithm is a new technique for combinatorial optimization borrowed from swarm intelligence. The operating time of manually controlled and automatically controlled switches is significantly different. Therefore both types of switches are considered separately.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Crowding Population Based Ant Colony Optimization for Service Restoration Problem in Distribution System

The crowding population based ant colony optimization algorithm (CP-ACO) uses a different pheromone update in comparison to other ACO algorithms. In this paper, crowding population based ant colony optimization algorithm is proposed to solve service restoration problem. The most notable achievement featured in this paper is run time reduction of algorithm to solve the service restoration task. ...

متن کامل

Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm

Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...

متن کامل

Robust Agent Based Distribution System Restoration with Uncertainty in Loads in Smart Grids

This paper presents a comprehensive robust distributed intelligent control for optimum self-healing activities in smart distribution systems considering the uncertainty in loads. The presented agent based framework obviates the requirements for a central control method and improves the reliability of the self-healing mechanism. Agents possess three characteristics including local views, decentr...

متن کامل

An Operational Planning Approach Distribution Automation Considering the Contribution of Demand Response Programs in Service Restoration Process

This paper proposes an advanced distribution automation planning problem in which emergency-based demand response plans are incorporated during service restoration process. The fitness function of this planning problem consists of various costs associated with fault occurrence in electric distribution systems consisting of the total yearly cost of customers’ interruptions, the total annualized ...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011